A Fast Block Matching Algorithm in Feature Domain
نویسنده
چکیده
Motion estimation is a computation-intensive procedure used in many coding schemes such as MPEG and H.261 to remove temporal redundancy in image sequences. In this paper, we describe an algorithm which can reduce computation significantly and achieve close-to-optimal performance in mean absolute difference(MAD) sense. In contrast with the conventional exhaustive search in pixel domain, we search in a feature domain to be followed by "reexamination" in pixel domain. Using our algorithm, the computation for each NxN block can be reduced by a factor of N/2 compared with the conventional exhaustive search.
منابع مشابه
An Improved Fast Feature-Based Block Motion Estimation
A fast block matching algorithm in the feature domain was proposed by Fok and Au which achieves a computation reduction factor of N/2 with search block size of N×N. This paper presents an improved fast block matching algorithm in the integral projections feature domain. This algorithm is based on the fast block matching algorithm in the feature domain and a new motion field sub-sampling scheme....
متن کاملImproved fast block matching algorithm in feature domain
A fast block matching algorithm in the feature domain was proposed by Fok and Au with a computation reduction factor of N/2 for a search block size of N×N. Although the algorithm can achieve close-to-optimal result, it requires a large amount of memory to store the features. This paper presents three improved fast block matching algorithms in the integral projections feature domain which can al...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملA Frequency Based Hierarchical Fast Search Block Matching Algorithm for Fast Video Communication
Numerous fast-search block motion estimation algorithms have been developed to circumvent the high computational cost required by the full-search algorithm. These techniques however often converge to a local minimum, which makes them subject to noise and matching errors. Hence, many spatial domain block matching algorithms have been developed in literature. These algorithms exploit the high cor...
متن کامل